edge graph
英 [edʒ ɡræf]
美 [edʒ ɡræf]
网络 边图
双语例句
- I've also applied an optional attribute to the edge label that names the edge on the graph.
我还对边使用了一个可选的属性label，用它来表示边在图中的名称。 - The graph can be serialized, listing every edge in the graph.
图可以序列化，列举图中的每一条边。 - Half Edge Graph and Extrude Intake Algorithm for Manufacturing Cell Design
半边图与挤出吸入算法及制造单元设计 - Proposed half edge graph theory, half edge belongs to vertex, a couple of half edges could assemble one edge.
论文提出半边图理论，半边附属于顶点，一对半边可结合为边。 - For a given graph C, If each edge of C is assigned a color, then G is an edge colored graph.
一个图的边染色称为是点可区别的，如果任意两个不同的顶点的关联边的颜色的集合不同。 - Every day they push out an updated multi-billion edge probabilistic relationship graph to their live site for querying in rendering web pages.
它每天都会向其站点推送出几十亿的边缘概率关系图，用于渲染网页时查询所用。 - Half edge graph theory can represent complex structure and various constraint accurately.
示例表明，半边图语言能够准确地表达可能解中的复杂结构和各种约束。 - But it's so close to the edge of the graph that it's kind of hard to see.
但是他太靠近图像的下方了，所以很难看的见。 - The graph with a quasi-strong edge colourings is called the quasi-strong edge colouring graph. This paper gives a classification for the quasi-strong edge colouring graphs.
具有准强边着色的图称为准强边着色图，并对准强边着色图给出一个分类。 - A necessary and sufficient conditions for a graph to be edge tenacious graph.
边韧性度图的充分必要条件。 - It takes a social actor as a vertex of a graph, and takes the relationship between two actors as an edge of a graph, and then use the algorithm of graph theory to resolve the problems of social network.
它将社会行动者映射为图的节点，社会行动者之间的关系映射为图中的边，然后利用图论的相关知识来解决社会网络的问题。 - The reasonable orientation problem of 2-edge connected graph
2-边连通图的合理定向问题 - The algorithm first makes a top-down coarse location using the projection analysis of the edge density graph and then makes a bottom-up precise location based on the vertical edge linkage intensity.
该算法首先通过对边缘密度图进行投影分析进行自顶向下的粗定位，然后在此基础上利用垂直边缘的连接强度进行自底向上的精确定位。 - The critical graph is connected and of class two and G-e is class one for any edge e of graph G.
临界图是连通的第二类图，而且对于G的任意一条边e，G-e是第一类图。 - A graph G is edge reconstructible if every edge reconstruction of graph G is isomorphic to graph G.
如果图G的每个边重构图都与图G同构，则称图G是边可重构的。 - This paper gives a classification of three-connected Ore-type graphes and also the lower bound of the length of the longest circle which contains whichever edge of the graph.
本文对3-连通Ore型图作了一个分类，给出了其中任一边所在的最长圈的长度的下界。 - Having Designed an extrude intake algorithm for the half edge graph partitioning problem, this algorithm can solve machine redundant manufacturing cell design problem.
设计了针对半边图划分问题的半边图挤出吸入算法，用此算法求解了机器可选制造单元成组设计问题。 - Implementation of Path Coverage Analysis Based on the Free Edge Control Flow Graph
基于自由边控制流图的路径覆盖分析实现方法 - A graph G is called a fractional k-uniform graph if for every edge of graph G, there is a fractional k-factor containing it and another fractional k-factor excluding it.
设G是一个图，如果对于图G的每一条边，都有一个分数k-因子覆盖它和另一个分数k-因子不包含它，则图G称为分数k一致图。 - Let G be a 2-edge-connected graph of order n.
设G是2-边-连通的n阶图。 - Based on the information of edge list in graph, this paper proposes a new all-pairs shortest path algorithm: EBSP ( Edges Based All-pairs Shortest Paths Algorithm).
基于边序列信息，论文提出了一种新的求取任意两点间最短路径的算法：EBSP（EdgesBasedall-pairsShortestPathsAlgorithm）。 - Edge reconstruction of graph
图的边重构性 - Hierarchical Recognition System of Half Edge Graph
半边图模型之多层次认知系统 - Trinocular stereo vision by edge pyramidal graph matching
用金字塔图法匹配边界图象的三眼立体视觉方法 - Half edge and its assembly can represent various constraints, Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph, multi-way half edge graph partitioning problem with redundant plan paths.
用半边及其结合性表示各种局部约束，将机器可选制造单元设计问题转化为基于半边图的组合优化问题，即计划路径可选的半边图划分问题。 - On t& edge colored complete graph k_n of order n
N阶完全图KN的t边着色 - A Note on the p Critical 2-Edge-Connected Graph
关于p阶临界2边连通图的一个注记 - Then the normal ″ 2m-1 ″ edge coloring for graph K 2m-1 and graph K 2m are respectively constructed.
然后分别构造出了图K2m-1和K2m的正常2m-1边着色。 - One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.
其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。 - The basic idea of topology expressing is abstracting the underground pipeline as graph, and treating the equipment as vertex of the graph and the pipe as edge of the graph.
其基本思想是将管网抽象成图结构，将设备抽象为图中的顶点，将管线抽象为图中的边。